Block Bootstrap for the Empirical Process of Long-Range Dependent Data
نویسندگان
چکیده
منابع مشابه
Dependent wild bootstrap for the empirical process
In this paper, we propose a model-free bootstrap method for the empirical process under absolute regularity. More precisely, consistency of an adapted version of the so-called dependent wild bootstrap, that was introduced by Shao (2010) and is very easy to implement, is proved under minimal conditions on the tuning parameter of the procedure. We apply our results to construct confidence interva...
متن کاملOptimum Block Size in Separate Block Bootstrap to Estimate the Variance of Sample Mean for Lattice Data
The statistical analysis of spatial data is usually done under Gaussian assumption for the underlying random field model. When this assumption is not satisfied, block bootstrap methods can be used to analyze spatial data. One of the crucial problems in this setting is specifying the block sizes. In this paper, we present asymptotic optimal block size for separate block bootstrap to estimate the...
متن کاملMatched { Block Bootstrap for Dependent
SUMMARY. The block bootstrap for time series consists in randomly resampling blocks of consecutive values of the given data and aligning these blocks into a bootstrap sample. Here we suggest improving the performance of this method by aligning with higher likelihood those blocks which match at their ends. This is achieved by resampling the blocks according to a Markov chain whose transitions de...
متن کاملMatched-block Bootstrap for Long Memory Processes Matched-block Bootstrap for Long Memory Processes
The block bootstrap for time series consists in randomly resampling blocks of consecutive values of the given data and aligning these blocks into a bootstrap sample The matched block bootstrap Carlstein et al samples blocks dependently attempting to follow each block with one that might realistically follow it in the underlying process to better match the dependence structure of the data Blocks...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Time Series Analysis
سال: 2017
ISSN: 0143-9782
DOI: 10.1111/jtsa.12256